On the Estrada index conjecture

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Estrada index of cacti

Let G be a simple connected graph on n vertices and λ1, λ2, . . . , λn be the eigenvalues of the adjacency matrix of G. The Estrada index of G is defined as EE(G) = Σ i=1 ei . A cactus is a connected graph in which any two cycles have at most one common vertex. In this work, the unique graph with maximal Estrada index in the class of all cacti with n vertices and k cycles was determined. Also, ...

متن کامل

Lower Bounds for Estrada Index

If G is an (n,m)-graph whose spectrum consists of the numbers λ1, λ2, . . . , λn, then its Estrada index is EE(G) = ∑n i=1 e λi . We establish lower bounds for EE(G) in terms of n and m. Introduction In this paper we are concerned with simple graphs, that have no loops and no multiple or directed edges. Let G be such a graph, and let n and m be the number of its vertices and edges. Then we say ...

متن کامل

The Estrada Index of Graphs

Let G be a simple n-vertex graph whose eigenvalues are λ1, . . . , λn. The Estrada index of G is defined as EE(G) = ∑n i=1 e λi . The importance of this topological index extends much further than just pure graph theory. For example, it has been used to quantify the degree of folding of proteins and to measure centrality of complex networks. The talk aims to give an introduction to the Estrada ...

متن کامل

Estrada Index of Benzenoid Hydrocarbons

A structure-descriptor EE, recently proposed by Estrada, is examined. If λ1, λ2, . . . ,λn are the eigenvalues of the molecular graph, then EE = n ∑ i=1 eλi . In the case of benzenoid hydrocarbons with n carbon atoms and m carbon-carbon bonds, EE is found to be accurately approximated by means of the formula a1 n cosh (√ 2m/n ) +a2, where a1 ≈ 1.098 and a2 =−0.64 are empirically determined fitt...

متن کامل

On the Maximum Estrada Index of 3-Uniform Linear Hypertrees

For a simple hypergraph H on n vertices, its Estrada index is defined as [Formula in text], where λ 1, λ 2,…, λ n are the eigenvalues of its adjacency matrix. In this paper, we determine the unique 3-uniform linear hypertree with the maximum Estrada index.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2009

ISSN: 0024-3795

DOI: 10.1016/j.laa.2009.05.007